Comparison of Newton-gauss with Levenberg-marquardt Algorithm for Space Resection
نویسنده
چکیده
Based on the perspective view of non-linear model fitting, a new algorithm for space resection based on Levenberg-Marquardt algorithm was developed in this paper. The relationship between the new algorithm and the current one, which is commonly implemented in the commercial software, was also discussed. The experimental evaluation of both algorithms with different level of inaccurate initial approximation was conducted, which demonstrates the superiority of the algorithm.
منابع مشابه
A New Damping Strategy of Levenberg-marquardt Algorithm for Multilayer Perceptrons
In this paper, a new adjustment to the damping parameter of the Levenberg-Marquardt algorithm is proposed to save training time and to reduce error oscillations. The damping parameter of the Levenberg-Marquardt algorithm switches between a gradient descent method and the Gauss-Newton method. It also affects training speed and induces error oscillations when a decay rate is fixed. Therefore, our...
متن کاملOne-Dimensional Modeling of Helicopter-Borne Electromagnetic Data Using Marquardt-Levenberg Including Backtracking-Armijo Line Search Strategy
In the last decades, helicopter-borne electromagnetic (HEM) method became a focus of interest in the fields of mineral exploration, geological mapping, groundwater resource investigation and environmental monitoring. As a standard approach, researchers use 1-D inversion of the acquired HEM data to recover the conductivity/resistivity-depth models. Since the relation between HEM data and model ...
متن کاملOn Iterative Krylov-Dogleg Trust-Region Steps for Solving Neural Networks Nonlinear Least Squares Problems
This paper describes a method of dogleg trust-region steps, or restricted Levenberg-Marquardt steps, based on a projection process onto the Krylov subspaces for neural networks nonlinear least squares problems. In particular, the linear conjugate gradient (CG) method works as the inner iterative algorithm for solving the linearized Gauss-Newton normal equation, whereas the outer nonlinear algor...
متن کاملHybrid Levenberg–Marquardt and weak-constraint ensemble Kalman smoother method
The ensemble Kalman smoother (EnKS) is used as a linear least-squares solver in the Gauss–Newton method for the large nonlinear least-squares system in incremental 4DVAR. The ensemble approach is naturally parallel over the ensemble members and no tangent or adjoint operators are needed. Furthermore, adding a regularization term results in replacing the Gauss–Newton method, which may diverge, b...
متن کاملPii: S0022-4073(02)00292-3
In this paper we present di0erent inversion algorithms for nonlinear ill-posed problems arising in atmosphere remote sensing. The proposed methods are Landweber’s method (LwM), the iteratively regularized Gauss–Newton method, and the conventional and regularizing Levenberg–Marquardt method. In addition, some accelerated LwMs and a technique for smoothing the Levenberg–Marquardt solution are pro...
متن کامل